Tootfinder

Vittime della mafia e giornalisti uccisi. I cronisti: sì al coordinamento Roma-Palermo
https://poliverso.org/display/0477a01e-42b81024-30694c75c447db44
Vittime della mafia e giornalisti uccisi. I cronisti: sì al coordinamento Roma-Palermo In occasio…

Ich bin dieses Jahr beim #Klimafrühling Oberland dabei 🎉
Bei unserer Veranstaltung geht es um Forschung für den Raum der Zukunft.
Mit dabei sind Felix Neureuther (ja genau, der Skifahrer), Prof. Dr. Sami Haddadin (TUM), Prof. Dr. HaPe Schmid (KIT), Prof. Dr. Claudia Traidl-Hoffmann (Uni Augsburg, UFS) und Forschende aus Garmisch.
Ich freu mich drauf!
Die Veran…

GAP forscht für den Raum der Zukunft — Klimafrühling
Innovationen für unseren Lebensraum heute & morgen  In unserer einzigartigen Umgebung betreiben WissenschaftlerInnen am Campus Alpin des Karlsruher Instituts für Technologie, am Forschungszentrum Geriatronik der Technischen Universität München und an der Umweltforschungsst

S6 Düsseldorf-Essen jahrelang gesperrt: Die S6 zwischen Düsseldorf und Essen bildet quasi die Keimzelle des S-Bahn-Verkehrs an Rhein und Ruhr (Inbetriebnahme Mai 1968). Nachdem die Strecke wegen des Höseler Tunnels bereits 2021 und 2023 mehrere Wochen gesperrt war, führte ein Hangrutsch im Januar 2024 dazu, dass der Verkehr seitdem eingestellt ist. Die Deutsche Bahn hat heute bekanntgegeben, dass sie derzeit mit dem Abschluss der Bauarbeiten und einer möglichen…

S6 Düsseldorf-Essen jahrelang gesperrt
S6 Düsseldorf-Essen jahrelang gesperrt

‘Als dit lukt, hebben we voor duizenden jaren energie’
https://fd.nl/tech-en-innovatie/1508587/als-dit-lukt-hebben-we-voor-duizenden-jaren-energie
Ja... Kernfusie is bijna volwassen.
... 'bijna' he? 😂
…

Invertibility of Discrete-Time Linear Systems with Sparse Inputs
Kyle Poe, Enrique Mallada, Rene Vidal
https://arxiv.org/abs/2403.20294 https://

Invertibility of Discrete-Time Linear Systems with Sparse Inputs
One of the fundamental problems of interest for discrete-time linear systems is whether its input sequence may be recovered given its output sequence, a.k.a. the left inversion problem. Many conditions on the state space geometry, dynamics, and spectral structure of a system have been used to characterize the well-posedness of this problem, without assumptions on the inputs. However, certain structural assumptions, such as input sparsity, have been shown to translate to practical gains in the p…

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
https://arxiv.org/abs/2405.01344

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
For a graph $G$, a subset $S\subseteq V(G)$ is called a resolving set of $G$ if, for any two vertices $u,v\in V(G)$, there exists a vertex $w\in S$ such that $d(w,u)\neq d(w,v)$. The Metric Dimension problem takes as input a graph $G$ on $n$ vertices and a positive integer $k$, and asks whether there exists a resolving set of size at most $k$. In another metric-based graph problem, Geodetic Set, the input is a graph $G$ and an integer $k$, and the objective is to determine whether there exists …

Co-rank $1$ Arithmetic Siegel--Weil I: Local non-Archimedean
Ryan C. Chen
https://arxiv.org/abs/2405.01426 https://arxiv.org/pdf/2405…

Co-rank $1$ Arithmetic Siegel--Weil I: Local non-Archimedean
This is the first in a sequence of four papers, where we prove the arithmetic Siegel--Weil formula in co-rank $1$ for Kudla--Rapoport special cycles on exotic smooth integral models of unitary Shimura varieties of arbitrarily large even arithmetic dimension. Our arithmetic Siegel--Weil formula implies that degrees of Kudla--Rapoport arithmetic special $1$-cycles are encoded in the first derivatives of unitary Eisenstein series Fourier coefficients. The crucial input is a new local limiting me…

Tensorized NeuroEvolution of Augmenting Topologies for GPU Acceleration
Lishuang Wang, Mengfei Zhao, Enyu Liu, Kebin Sun, Ran Cheng
https://arxiv.org/abs/2404.01817

Tensorized NeuroEvolution of Augmenting Topologies for GPU Acceleration
The NeuroEvolution of Augmenting Topologies (NEAT) algorithm has received considerable recognition in the field of neuroevolution. Its effectiveness is derived from initiating with simple networks and incrementally evolving both their topologies and weights. Although its capability across various challenges is evident, the algorithm's computational efficiency remains an impediment, limiting its scalability potential. In response, this paper introduces a tensorization method for the NEAT algorit…

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
https://arxiv.org/abs/2405.01344

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
For a graph $G$, a subset $S\subseteq V(G)$ is called a resolving set of $G$ if, for any two vertices $u,v\in V(G)$, there exists a vertex $w\in S$ such that $d(w,u)\neq d(w,v)$. The Metric Dimension problem takes as input a graph $G$ on $n$ vertices and a positive integer $k$, and asks whether there exists a resolving set of size at most $k$. In another metric-based graph problem, Geodetic Set, the input is a graph $G$ and an integer $k$, and the objective is to determine whether there exists …

Lower Bounds for the Large Deviations of Selberg's Central Limit Theorem
Louis-Pierre Arguin, Emma Bailey
https://arxiv.org/abs/2403.19803 https://

Lower Bounds for the Large Deviations of Selberg's Central Limit Theorem
Let $δ>0$ and $σ=\frac{1}{2}+\tfracδ{\log T}$. We prove that, for any $α>0$ and $V\sim α\log \log T$ as $T\to\infty$, $\frac{1}{T}\text{meas}\big\{t\in [T,2T]: \log|ζ(σ+\rm{i} τ)|>V\big\}\geq C_α(δ)\int_V^\infty \frac{e^{-y^2/\log\log T}}{\sqrt{π\log\log T}} \rm{d} y,$ where $δ$ is large enough depending on $α$. The result is unconditional on the Riemann hypothesis. As a consequence, we recover the sharp lower bound for the moments on the critical line proved by Heap & So…